A Unified Approach to the Proportional Relation for Discrete-Time Single-Server Queues Naoto Miyoshi, Fumio Ishizaki

نویسندگان

  • Naoto Miyoshi
  • Fumio Ishizaki
چکیده

It is well known that a simple relation called proportional relation holds for some queueing models, that is, the stationary queue length distribution of one system can be expressed as the product of a constant and the distribution of another system which is different only in the buffer capacity. Recently, the proportional relation has been verified for various discrete-time single-server queues with correlated arrivals, where it has been also shown that the proportional constant can be expressed in terms of the distribution of one system. This implies that the stationary queue length distribution of one system can be completely expressed in terms of the distribution of the other system. In this paper, we consider a generalized model of discrete-time single-server queue, which covers all previous ones, and give a simple and unified proof to the proportional relation as well as the expression of the proportional constant.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Unified Approach to the Proportional Relation for Discrete-time Single-server Queues

It is known that a simple relation called proportional relation holds for many queueing models, that is, the stationary queue-length distribution of one system can be expressed as the product of a constant and the distribution of another system which is different only in the buffer capacity. Recently, the proportional relation has been verified for various discretetime single-server queues with...

متن کامل

Sample-path version of the unified approach to the proportional relation for discrete-time single-server queues

In [5], the authors have considered a discrete-time queueing system and they have established that, under some assumptions, the stationary queue length distribution for the system with capacity K1 is completely expressed in terms of the stationary distribution for the system with capacity K0 (> K1). In this paper, we study a sample-path version of this problem in more natural setting, where nei...

متن کامل

Decomposition Property in a Discrete-time Queue with Multiple Input Streams and Service Interruptions

This paper studies a discrete-time single-server queue with two independent inputs and service interruptions. One of the inputs to the queue is an independent and identically distributed process. The other is a much more general process and it is not required to be Markov nor is it required to be stationary. The service interruption process is also general and it is not required to be Markov or...

متن کامل

Sample-path Analysis of the Proportional Relation and Its Constant for Discrete-time Single-server Queues

In the previous work, the authors have considered a discrete-time queueing system and they have established that, under some assumptions, the stationary queue length distribution for the system with capacity K1 is completely expressed in terms of the stationary distribution for the system with capacity K0 (> K1). In this paper, we study a sample-path version of this problem in more general sett...

متن کامل

On the Subexponential Properties in Stationary Single-server Queues: A Palm-martingale Approach

This paper studies the subexponential properties of the stationary workload, actual waiting time and sojourn time distributions in work-conserving single-server queues when the equilibrium residual service time distribution is subexponential. This kind of problem has been so far investigated in various queueing and insurance risk settings. For example, it has been shown that, when the queue has...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2002